Efficient Deconvolution Algorithm

نویسنده

  • Gopal Rao
چکیده

This thesis describes the design of a new deconvolution approach known as Efficient Deconvolution algorithm so that reconstruction image will be free from both blur and noise. This algorithm comprises two steps, a global blur compensation using generalized Wiener filter, followed by a pure local denoising algorithm using dual-tree complex wavelet transform (DT-CWT). The main advantage of this decomposition is that the deconvolution problem is converted into an easier nonwhite noise removal problem, at the likely price of losing global optimality. Given the increasingly high performance of current denoising methods, this approach has become an appealing practical alternative. Our algorithm has also exploited the properties of DT-CWT viz. nearly shift invariant, excellent directionality and explicit phase information to remove noise without the need for assuming a specific noise model. This algorithm is applicable to all ill-conditioned problems, unlike the purely wavelet based deconvolution algorithm WVD; moreover, its estimate features minimal ringing, unlike the purely Fourier based Wiener deconvolution. Also, the performance of this system is demonstrated based on some comparisons with the best available wavelet-based image denoising techniques.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

PSO-Optimized Blind Image Deconvolution for Improved Detectability in Poor Visual Conditions

Abstract: Image restoration is a critical step in many vision applications. Due to the poor quality of Passive Millimeter Wave (PMMW) images, especially in marine and underwater environment, developing strong algorithms for the restoration of these images is of primary importance. In addition, little information about image degradation process, which is referred to as Point Spread Function (PSF...

متن کامل

Guided Filter based Edge-preserving Image Non-blind Deconvolution

In this work, we propose a new approach for efficient edgepreserving image deconvolution. Our algorithm is based on a novel type of explicit image filter guided filter. The guided filter can be used as an edge-preserving smoothing operator like the popular bilateral filter, but has better behaviors near edges. We propose an efficient iterative algorithm with the decouple of deblurring and denoi...

متن کامل

Efficient model-free deconvolution of measured femtosecond kinetic data using a genetic algorithm

J. Chemom Due to the uncertainty relation between the temporal and spectral widths of a laser pulse, sufficient selectivity in excitation and detection energy does not allow much shorter pulses in a femtosecond pump-probe experiment than about 100 fs. Many ultrafast chemical processes have comparable characteristic times, so the results of these experiments are severely distorted by convolution...

متن کامل

Frequency Domain Realization of a Multichannel Blind Deconvolution Algorithm Based on the Natural Gradient

This paper describes two efficient realizations of an adaptive multichannel blind deconvolution algorithm based on the natural gradient algorithm originally proposed by Amari, Douglas, Cichocki, and Yang. The proposed algorithms use fast convolution and correlation techniques and operate primarily in the frequency domain. Since the cost function minimized by the algorithms is welldefined in the...

متن کامل

Efficient Maximum A Posteriori Deconvolution of Sparse Structures

A new algorithm for maximum a posteriori deconvolution, Iterated Window Maximization (IWM), was recently proposed by Kaaresen. The algorithm was derived for a particular sparse spike train model, and was in a later simulation study found to perform better than a number of established alternatives. The purpose of the present paper is to show how the same simple and efficient technique can be gen...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012